A greedy stacking algorithm for model ensembling and domain weighting
نویسندگان
چکیده
منابع مشابه
Greedy Algorithm for the Analysis Transform Domain
Many signal and image processing applications have benefited remarkably from the theory of sparse representations. In the classical synthesis model, the signal is assumed to have a sparse representation under a given known dictionary. The algorithms developed for this framework mainly operate in the representation domain. Recently, a new model has been introduced, the cosparse analysis one, in ...
متن کاملSelf-ensembling for domain adaptation
This paper explores the use of self-ensembling for visual domain adaptation problems. Our technique is derived from the mean teacher variant [20] of temporal ensembling [8], a technique that achieved state of the art results in the area of semi-supervised learning. We introduce a number of modifications to their approach for challenging domain adaptation scenarios and evaluate its effectiveness...
متن کاملSelf-ensembling for visual domain adaptation
This paper explores the use of self-ensembling for visual domain adaptation problems. Our technique is derived from the mean teacher variant [29] of temporal ensembling [14], a technique that achieved state of the art results in the area of semi-supervised learning. We introduce a number of modifications to their approach for challenging domain adaptation scenarios and evaluate its effectivenes...
متن کاملA greedy algorithm for the analysis transform domain
Many signal and image processing applications have benefited remarkably from the theory of sparse representations. In the classical synthesis model, the signal is assumed to have a sparse representation under a given known dictionary. The algorithms developed for this framework mainly operate in the representation domain. Recently, a new model has been introduced, the cosparse analysis one, in ...
متن کاملA ranking model for the greedy algorithm and discrete convexity
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, we introduce a combinatorial model that allows us to define and analyze matroid-type greedy algorithms. The model is based on a real-valued function v on a (finite) family of sets which yields the constraints of a combinatorial linear program. Moreover, v gives rise to a ranking and selection proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Research Notes
سال: 2020
ISSN: 1756-0500
DOI: 10.1186/s13104-020-4931-7